Comparative Evaluation Of The Robustness Of DAG Scheduling Heuristics

نویسندگان

  • Louis-Claude Canon
  • Emmanuel Jeannot
  • Rizos Sakellariou
  • Wei Zheng
چکیده

In this paper we analyze the robustness of 20 static, makespan-centric, DAG scheduling heuristics of the literature. We also study if dynamically changing the order of the tasks on their assigned processor improves the robustness. Based on experimental results we investigate how robustness and makespan are correlated. Finally, the heuristics are experimentally evaluated and ranked according to their performance in both robustness and makespan.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems

Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...

متن کامل

Evaluating Heuristics for Scheduling Dependent Jobs in Grid Computing Environments

Job scheduling plays a critical role in the utilisation of grid resources by mapping a number of jobs to grid resources. However, the heterogeneity of grid resources adds some challenges to the work of job scheduling, especially when jobs have dependencies which can be represented as Direct Acyclic Graphs (DAGs). It is widely recognised that scheduling m jobs to n resources with an objective to...

متن کامل

Heuristics Analysis for Distributed Scheduling using MONARC Simulation Tool

Simulation is a very powerful method used for highperformance and high-quality design in distributed system, and now maybe the only one, considering the heterogeneity, complexity and cost of distributed systems. In Grid environments, foe example, it is hard and even impossible to perform scheduler performance evaluation in a repeatable and controllable manner as resources and users are distribu...

متن کامل

Truck Scheduling in a Cross-Docking Terminal by Using Novel Robust Heuristics

Nowadays, one of the major goals of the distribution environment is to reduce lead times and inventories. Cross-docking is a logistics technique which removes the storage and picking up the functions of a warehouse. The term cross-docking refers to moving products directly from incoming to outgoing trailers with little or no storage in between. According to the recent related papers, the truck ...

متن کامل

List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures

In the area of static scheduling, list scheduling is one of the most common heuristics for the temporal and spatial assignment of a directed acyclic graph (DAG) to a target system. As most scheduling heuristics, list scheduling assumes fully connected homogeneous processors and ignores contention on the communication links. This article extends the list scheduling heuristic for contention aware...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008